2006): “Fast Gauss transforms with complex parameters using NFFTs

We construct a fast algorithm for the computation of discrete Gauss transforms with complex parameters, capable of dealing with non equispaced points. Our algorithm is based on the fast Fourier transform at non equispaced knots and requires only O(N) arithmetic operations. Key words and phrases. Gauss transform; Unequally spaced Fourier transforms; Fast algorithms; Chirped Gaussian; NFFT